Geometric construction of voting methods that protect voters' first choices

نویسنده

  • Alex Small
چکیده

We consider the possibility of designing an election method that eliminates the incentives for a voter to rank any other candidate equal to or ahead of his or her sincere favorite. We refer to these methods as satisfying the " Strong Favorite Betrayal Criterion " (SFBC). Methods satisfying our strategic criteria can be classified into four categories, according to their geometrical properties. We prove that two categories of methods are highly restricted and closely related to positional methods (point systems) that give equal points to a voter's first and second choices. The third category is tightly restricted, but if criteria are relaxed slightly a variety of interesting methods can be identified. Finally, we show that methods in the fourth category are largely irrelevant to public elections. Interestingly, most of these methods for satisfying the SFBC do so only " weakly, " in that these methods make no meaningful distinction between the first and second place on the ballot. However, when we relax our conditions and allow (but do not require) equal rankings for first place, a wider range of voting methods are possible, and these methods do indeed make meaningful distinctions between first and second place.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Double voter perceptible blind signature based electronic voting protocol

Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...

متن کامل

E¢ ciency, Equity, and Timing of Voting Mechanisms1

We compare the behavior of voters under simultaneous and sequential voting rules when voting is costly and information is incomplete. In many political institutions, ranging from small committees to mass elections, voting is sequential, which allows some voters to know the choices of earlier voters. For a stylized model, we generate a variety of predictions about the relative e¢ ciency and part...

متن کامل

The Dark Side of the Vote : Biased Voters , Social

The Dark Side of the Vote: Biased Voters, Social Information, and Information Aggregation Through Majority Voting by Rebecca B. Morton, Marco Piovesan and Jean-Robert Tyran* We experimentally investigate information aggregation through majority voting when some voters are biased. In such situations, majority voting can have a “dark side,”that is, result in groups making choices inferior to thos...

متن کامل

Weighted Voting Via No-Regret Learning

Voting systems typically treat all voters equally. We argue that perhaps they should not: Voters who have supported good choices in the past should be given higher weight than voters who have supported bad ones. To develop a formal framework for desirable weighting schemes, we draw on no-regret learning. Specifically, given a voting rule, we wish to design a weighting scheme such that applying ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1008.4331  شماره 

صفحات  -

تاریخ انتشار 2010